Voer een woord of zin in in een taal naar keuze 👆
Taal:
Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT
Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:
- hoe het woord wordt gebruikt
- gebruiksfrequentie
- het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
- opties voor woordvertaling
- Gebruiksvoorbeelden (meerdere zinnen met vertaling)
- etymologie
complete matching - vertaling naar russisch
SET OF EDGES WITHOUT COMMON VERTICES
Maxmimal matching; Bipartite matching; Matched edge; Matched vertex; Maximal matching; Minimum maximal matching; Maximum bipartite matching; Matching number; Maximum matching problem; Matched edges; Complete matching; Bipartite maximum matching; Matching (graph)
complete matching
математика
полное паросочетание
matching grant
DONATION BASED ON OTHERS' DONATIONS
Matching fund; Matching gift; Matching gifts; Matching donations; Matching donation; Matching git; Match funding; Matched funding; Donation matching; Matching grants; Matching grant; Match fund
долевая субсидия (когда средства федерального бюджета покрывают лишь часть расходов низшей административной единицы)
tetrahedral graph
![Two tetrahedra in a cube]]](https://commons.wikimedia.org/wiki/Special:FilePath/CubeAndStel.svg?width=200 "Two tetrahedra in a cube]]")
![[[Compound of five tetrahedra]]](https://commons.wikimedia.org/wiki/Special:FilePath/Compound of five tetrahedra.png?width=200 "[[Compound of five tetrahedra]]")
![[[Compound of ten tetrahedra]]](https://commons.wikimedia.org/wiki/Special:FilePath/Compound of ten tetrahedra.png?width=200 "[[Compound of ten tetrahedra]]")
SIMPLE UNDIRECTED GRAPH IN WHICH EVERY PAIR OF DISTINCT VERTICES IS CONNECTED BY A UNIQUE EDGE
Full graph; Complete Digraph; Complete digraph; K n; Tetrahedral Graph; Complete graphs
математика
тетраэдральный граф
Definitie
complete graph
A graph which has a link between every pair of nodes. A
complete bipartite graph can be partitioned into two subsets
of nodes such that each node is joined to every node in the
other subset.
(1995-01-24)
Wikipedia
Matching (graph theory)
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset of the edges is a matching if each vertex appears in at most one edge of that matching. Finding a matching in a bipartite graph can be treated as a network flow problem.
